Ax–Grothendieck theorem

In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.[1][2][3][4]

The theorem is often given as the special case as follows: If P is a polynomial function from \mathbf{C}^n to \mathbf{C}^n and P is injective then P is bijective. That is, if P is one-to-one then P is onto.[3][4]

The full theorem generalizes to any algebraic variety over an algebraically closed field.[5]

Contents

Proof via finite fields

Grothendieck's proof of the theorem[3][4] is based on proving the analogous theorem for finite fields and their algebraic closures. That is, for any field F that is itself finite or that is the closure of a finite field, if a polynomial P from Fn to itself is injective then it is bijective.

If F is a finite field, then Fn is finite. In this case the theorem is true for trivial reasons having nothing to do with the representation of the function as a polynomial: any injection of a finite set to itself is a bijection. When F is the algebraic closure of a finite field, the result follows from Hilbert's Nullstellensatz. The Ax–Grothendieck theorem for complex numbers can therefore be proven by showing that a counterexample over \mathbf{C} would translate into a counterexample in some algebraic extension of a finite field.

This method of proof is noteworthy in that it is an example of the idea that finitistic algebraic relations in fields of characteristic 0 translate into algebraic relations over finite fields with large characteristic.[3] Thus, one can use the arithmetic of finite fields to prove a statement about \mathbf{C} even though there is no non-trivial homomorphism from any finite field to \mathbf{C}. The proof thus uses model theoretic principles to prove an elementary statement about polynomials. The proof for the general case uses a similar method.

Other proofs

There are other proofs of the theorem. Armand Borel gave a proof using topology.[4] The case of n = 1 and field \mathbf{C} follows since \mathbf{C} is algebraically closed and can also be thought of as a special case of the result that for any analytic function f on \mathbf{C}, injectivity of f implies surjectivity of f. This is a corollary of Picard's theorem.

Related results

Another example of reducing theorems about morphisms of finite type to finite fields can be found in EGA IV: There, it is proved that a radicial S-endomorphism of a scheme X of finite type over S is bijective (10.4.11), and that if X/S is of finite presentation, and the endomorphism is a monomorphism, then it is an automorphism (17.9.6).

The Ax–Grothendieck theorem may also be used to prove the Garden of Eden theorem, a result that like the Ax–Grothendieck theorem relates injectivity with surjectivity but in cellular automata rather than in algebraic fields. Although direct proofs of this theorem are known, the proof via the Ax–Grothendieck theorem extends more broadly, to automata acting on amenable groups.[6]

References

  1. ^ Ax, James (1968), "The elementary theory of finite fields", Annals of Mathematics (2nd ser.) (Annals of Mathematics) 88 (2): 239–271, doi:10.2307/1970573, JSTOR 1970573 .
  2. ^ Grothendieck, A. (1966), Éléments de géométrie algébrique. IV. Étude locale des schémas et des morphismes de schémas. III., Inst. Hautes Études Sci. Publ. Math., 28, pp. 103-104, Theorem 10.4.11 .
  3. ^ a b c d Tao, Terence (2009-03-07). "Infinite fields, finite fields, and the Ax-Grothendieck theorem". What's New. http://terrytao.wordpress.com/2009/03/07/infinite-fields-finite-fields-and-the-ax-grothendieck-theorem/#more-1869. Retrieved 2009-03-08. 
  4. ^ a b c d Serre, Jean-Pierre (2009), "How to use finite fields for problems concerning infinite fields", Arithmetic, geometry, cryptography and coding theory, Contemp. Math., 487, Providence, R.I.: Amer. Math. Soc., pp. 183–193, arXiv:0903.0517, MR2555994 
  5. ^ Éléments de géométrie algébrique, IV3, Proposition 10.4.11.
  6. ^ Ceccherini-Silberstein, Tullio; Coornaert, Michel (2010), On algebraic cellular automata, arXiv:1011.4759 .

External links